Languages for Secure Multiparty Computation and Towards Strongly Typed Macros

نویسنده

  • Janus Dam Nielsen
چکیده

We show that it is feasible and useful to create programming languages with strong security guarantees for secure multiparty computation. We have designed and implemented the Secure Multiparty Computation Language (SMCL), which is a domain-specific programming language for secure multiparty computation. SMCL allows programmers to write programs using secure multiparty computation without expert knowledge on how to design and implement cryptographic protocols. We have proven that programs written in SMCL are immune to a broad range of security threads and confidential information may only be revealed in specific parts of a program, designated by the programmer. We demonstrate the usefulness of SMCL by reporting on how an SMCL program contributed to the first large-scale practical application of secure multiparty computation. Based on our experiences with SMCL we have designed a successor called PySMCL which is a domain-specific language embedded in Python, and will provide even better security guarantees than SMCL. We also show that syntactic abstraction can enable programming languages to evolve over time by adding new libraries with syntax and semantics as they become needed. This is an important feature because it is difficult to anticipate which language concepts becomes needed over the lifetime of a programming language. We have designed and implemented a hygienic syntactic abstraction system for the Fortress programming language based on parsing expression grammars. The system allows syntactic extensions of Fortress to be specified in a modular fashion and added in libraries as needed. The system also allows us to not only support new language extensions, but also to move many constructs of the core language into libraries. We have designed a type system which extend the guarantees provided by the Fortress type system to the combined language of Fortress and our system for syntactic abstraction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and formal verification of DZMBE+

In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...

متن کامل

An Anonymous Reputation System with Reputation Secrecy for Manager

Secure Multiparty Computation Privacy Assurances in Multiple Data-Aggregation Transactions. . . . . . . . . . . 3 Kim Le, Parmesh Ramanathan, and Kewal K. Saluja A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 Tomas Toft Towards Secure Two-Party Computation from the Wire-Tap Channel . . . . ...

متن کامل

پروتکل کارا برای جمع چندسویه امن با قابلیت تکرار

In secure multiparty computation (SMC), a group of users jointly and securely computes a mathematical function on their private inputs, such that the privacy of their private inputs will be preserved. One of the widely used applications of SMC is the secure multiparty summation which securely computes the summation value of the users’ private inputs. In this paper, we consider a secure multipar...

متن کامل

Towards a Local Electricity Trading Market based on Secure Multiparty Computation

This paper presents a local electricity trading market that allows users to trade excess electricity among themselves in a decentralised and privacy-preserving manner. Users who have more electricity generated by their renewable energy sources than they need for themselves, can sell this electricity to other users using a bidding mechanism based on secure multiparty computations. Based on the b...

متن کامل

Typed Syntax Macros

Using parser combinators we can dynamically generate parsers. We show how this property is used to define or to extend the syntax of a programming language from within a program itself, thus bringing the idea of “Syntax Macros” to life again. Part of the context-sensitive constraints that consequently have to be obeyed are enforced by dynamically constructing new parsers that only accept langua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009